|
Chris Pollett >
Old Classes
> |
CS156 Spring 2004Practice Midterm 2To study for the midterm I would suggest you: (1) Know how to do (by heart) all the practice problems. (2) Go over your notes three times. Second and third time try to see how huch you can remember from the first time. (3) Go over the homework problems. (4) Try to create your own problems similar to the ones I have given and solve them. (5) Skim the relevant sections from the book. (6) If you want to study in groups, at this point you are ready to quiz each other. The practice midterm is below. Here are some facts about the actual midterm: (a) The midterm will be in class . (b) It is closed book, closed notes. Nothing will be permitted on your desk except your pen (pencil) and test. (c) You should bring photo ID. (d) There will be more than one version of the test. Each version will be of comparable difficulty. (e) If your cell-phone or beeper goes off you will be excused from the test at that point and graded on what you have done till your excusal. (f) One problem (less typos) on the actual test will be from the practice test. 1. Convert the following formula to CNF: (A AND (( (B AND C) OR G) AND (NOT A))). 2. Make the result of problem 1 into a set of resolution clauses and give a resolution refuation based on them. 3. Consider the following set of rules and facts: A. B :- A, C. E :- A. C :- E. C. Explain how the backward chaining algorithms would satisfy the goal B in this situation. 4. Explain how forward chaining would work on the goal B for the program in Problem 4. 5. Express the statement: ``Every minute has a sucker born in it'' as a sentence in first order logic. Assume you have the base predicates Minute(x), Sucker(x), BornWhen(x,y) (where x is intended to be a person and y represent some minute). 6. Show how the unification algorithm would produce a most general unifier for the following terms: t(s(h(x),0),z) and t(d,g(s(n,m))). 7. Write a short prolog program that checks if a string with characters which are only open and closed parentheses is well parenthesized. Write your program first as a definite clause grammar and then in usual prolog syntax. 8. Define the following terms: effect axiom, possibility axiom, frame problem. 9. Recall the stack three blocks problem and situation calculus described in class. Explain the steps involved in using the regression planning algorithm to solve this problem. 10. Consider the problem of choosing classes to take to complete your bachelor's degree. Express this formally as a partial order planning problem. |